MPCC: 一种用于Ad Hoc网络多径路由的优化拥塞控制算法

doi:10.13190/jbupt.200705.41.354

北京邮电大学学报 ›› 2007, Vol. 30 ›› Issue (5): 41-45.doi: 10.13190/jbupt.200705.41.354

MPCC: 一种用于Ad Hoc网络多径路由的优化拥塞控制算法

徐伟强1, 2，汪亚明1，包晓安1, 陈积明2

(1. (浙江理工大学信息电子学院, 杭州 310018; 2. 浙江大学信息科学与工程学院, 杭州 310027)

收稿日期:2006-11-06 修回日期:2006-12-28 出版日期:2007-10-30 发布日期:2007-10-30
通讯作者: 徐伟强

MPCC: Optimal Congestion Control for Multipath Routing in Ad Hoc Networks

XU Wei-qiang1,2, WANG Ya-ming1, BAO Xiao-an1, CHEN Ji-ming2+

(1. College of Informatics and Electronics, Zhejiang Sci-Tech University, Hangzhou 310018, China;
2. College of Information Science and Engineering, Zhejiang University, Hangzhou 310027, China)

Received:2006-11-06 Revised:2006-12-28 Online:2007-10-30 Published:2007-10-30
Contact: XU Wei-qiang

摘要/Abstract

摘要：

基于Ad hoc网络中信息流之间的竞争特点，引入了链路干扰集的概念，并将描述Internet中多径路由拥塞控制问题的多径效用最大化问题推广到Ad hoc网络中. 由于多径效用最大化问题中的目标函数对路径速率而言不是严格凹的，所以运用罚函数法将此最大化问题转化成新的等价形式，再运用次梯度法获得了原问题的最优解，由此提出了用于Ad hoc网络的多径路由优化拥塞控制算法MPCC. 链路和源节点能独立平行地执行该算法. 仿真结果表明，MPCC能快速收敛到最优解，对网络状态的变化具有较好的自适应能力，所获得网络性能比TCP-Reno的AIMD算法要优越，因此适用于实际Ad h oc网络.

关键词: Ad hoc网络, 拥塞控制, 多径路由, 罚函数, 次梯度

Abstract:

Based on the inherent characteristic of the contention relationship between flows in Ad hoc networks, a notion of the link’s interference set is introduced , it extends the multipath utility maximization formulating the congestion control problem for multipath routing in Internet to that in Ad hoc networks. As the objective function is not strictly concave in the path rate, the penalty function method is applied to transform the primal problem into a new formulation to obtain the optimal solution based on the subgradient method. And the multiPath congestion control algorithm (MPCC) is also proposed. It can be implemented in a parallel fashion at each source/link. Simulation results show that MPCC can quickly quickly converge to globally optimal solutions; and, compared to the additive-increase-multiplicative-decrease (AIMD) algorithm in TCP-Reno, MPCC is more adaptive to time-varying network situations, and achieves better network performance. And thus it can be used to the practical Ad hoc networks.

Key words: Ad hoc networks, congestion control, multipath routing, penalty function, subgradient

中图分类号:

TN393

徐伟强1, 2，汪亚明1，包晓安1, 陈积明2. MPCC: 一种用于Ad Hoc网络多径路由的优化拥塞控制算法[J]. 北京邮电大学学报, 2007, 30(5): 41-45.

XU Wei-qiang1,2, WANG Ya-ming1, BAO Xiao-an1, CHEN Ji-ming2+. MPCC: Optimal Congestion Control for Multipath Routing in Ad Hoc Networks[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(5): 41-45.

参考文献

[1] Chlamtac I, Conti M, Liu J J N. Mobile Ad hoc networking: imperatives and challenges[J]. Ad Hoc Networks, 2003, 1(1):13–64.
[2] Frank P K, Maulloo A, Tan D. Rate control for communication networks: Shadow prices, proportional fairness and stability[J]. Journal of Operations Research Society, 1998,49(3):237-252.
[3] Han H, Shakkottai S . Overlay TCP for multi-path routing and congestion control [C]// The IMA Workshop on Measurements and Modeling of the Internet. Urbana-Champaign, Illinois：[s.n.], 2004.
[4] Kar K, Sarkar S, Tassiulas L. Optimization based rate control for multipath sessions [C]// The 17th International Teletraffic Congress (ITC 2001). Salvador da Bahia, Brazil： [s.n.], 2001.
[5] Low S H. Multipath optimization flow control[C]// 8th IEEE International Conference on Networks (ICON 2000). Singapore:[s.n.], 2000.
[6] Wang W, Palaniswami M, Low S H. Optimal flow control and routing in multi-path networks[J]. Performance Evaluation, 2003，52(2-3):119-132.
[7] Lin X, Shroff N B. The multi-path utility maximization problem[C]// 41st Annual Allerton Conference on Communication, Control, and Computing. Monticello:[s.n.], 2003.
[8] Lin X, Shroff N B. Utility maximization for communication networks with multi-path routing[J]. IEEE Transactions on Automatic Control, 2006, 51(5):766-781.
[9] Srinivasan V, Chiasserini C F, Nuggehalli P S, et al. Optimal rate allocation for energy-efficient multipath routing in wireless Ad hoc networks[J]. IEEE Transactions on Wireless Communications, 2004, 3(3):891-899.
[10] Xu W Q, Wu T J. Optimal congestion control algorithm for ad hoc networks: Penalty function-based approach[J]. Zhejiang University, Science A, 2006, 7(12):2110-2117.
[11] Kar K, Sarkar S, Tassiulas L. A scalable, low-overhead rate control algorithm for multirate multicast sessions[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(8): 1541-1557.
[12] Xu W Q, Wu T J. TCP issues in mobile ad hoc networks: challenges and solutions[J]. Journal of Computer Science and Technology, 2006, 21(1):72-81.

[1]	余修武, 张可, 刘永. 基于罚函数与水波优化的WSN定位算法[J]. 北京邮电大学学报, 2020, 43(4): 106-112.
[2]	白媛, 安杰, 张会兵. 预测辅助的Ad hoc网络路由协议[J]. 北京邮电大学学报, 2017, 40(s1): 29-33.
[3]	温景容武穆清吕博汪东洋. 非均匀多信道Ad Hoc网络信道选择方法[J]. 北京邮电大学学报, 2013, 36(2): 10-14.
[4]	王英赫宋梅陈浩张英海. Ad Hoc网络中采用功率调整的单向链路通告策略[J]. 北京邮电大学学报, 2012, 35(5): 102-106.
[5]	刘洺辛于倩. Ad Hoc网络中基于传输状态的自适应退避算法[J]. 北京邮电大学学报, 2012, 35(4): 68-71.
[6]	赵成林谭虎毛松. 利用路径优先级实现传感器网络中的拥塞避免[J]. 北京邮电大学学报, 2012, 35(1): 15-18.
[7]	李陶深，韦燕霞，葛志辉. 跨层负载感知的无线Mesh网络拥塞控制[J]. 北京邮电大学学报, 2011, 34(1): 50-54.
[8]	刘期烈李云潘英俊赵玲. 延迟容忍网络中基于复制率的拥塞控制算法[J]. 北京邮电大学学报, 2010, 33(4): 88-92.
[9]	余旺科马文平严亚俊杨元原. 利用信任模型构建安全路由协议[J]. 北京邮电大学学报, 2010, 33(3): 48-51.
[10]	汪浩田作华. 用于队列管理的模糊增益神经元自适应控制器[J]. 北京邮电大学学报, 2010, 33(2): 99-104.
[11]	扈鹏;刘元安;马晓雷;高松. Ad Hoc网络中按需路由协议的动态广播算法[J]. 北京邮电大学学报, 2009, 32(6): 53-56.
[12]	杨卫东. 用于Ad Hoc网络的分簇算法[J]. 北京邮电大学学报, 2009, 32(5): 61-65.
[13]	赖峻, 叶梧, 冯穗力. QDB-AQM: 基于排队延时的网关拥塞控制设计[J]. 北京邮电大学学报, 2008, 31(5): 30-35.
[14]	翟立东，刘元安，马晓雷，高锦春. 发布/订阅通信机制在移动Ad Hoc网络中的应用[J]. 北京邮电大学学报, 2008, 31(2): 30-33.
[15]	苗建松，丁炜，孙丹丹. 移动Ad Hoc网络中基于能量的自适应广播策略（增刊）[J]. 北京邮电大学学报, 2007, 29(s1): 1-4.

MPCC: 一种用于Ad Hoc网络多径路由的优化拥塞控制算法

MPCC: Optimal Congestion Control for Multipath Routing in Ad Hoc Networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价